P-complete problems in data compression

P-complete Problems in Data Compression

De Agostino, S., P-complete problems in data compression, Theoretical Computer Science 127 (1994) 181-186. In this paper we study the parallel computational complexity of some methods for compressing data via textual substitution. We show that the Ziv-Lempel algorithm and two standard variations are P-complete. Hence an efficient parallelization of these algorithms is not possible uqless P = NC.

Parallelizability of Some P-Complete Problems

In this paper, we consider parallelizability of some P complete problems. First we propose a parameter which indicates parallelizability for a convex layers problem. We prove P -completeness of the problem and propose a cost optimal parallel algorithm, according to the parameter. Second we consider a lexicographically first maximal 3 sums problem. We prove P -completeness of the problem by redu...

Two P-Complete Problems in the Theory of the Reals

A classical subject in computational complexity is what is usually called algebraic complexity. This area deals with the complexity of algorithms that take their inputs on R " , where R is a ring, understood as the number of ring operations the algorithm performs as a function of IZ, and the main kind of results are both upper and lower bounds. A recent survey about this topic is (von zur Gathe...

DHT ⊲ P 2 P Dictionary - Based Data Compression

Proceedings SWAT 88, First Scandinavian Workshop on Algorithm Theory. Lecture Notes in Computer Science, vol. 318, pp. 176–189. Halmstad, Sweden (1988) 3. Baeza-Yates, R., Schott, R.: Parallel searching in the plane. Comput. Geom. Theor. Appl. 5, 143–154 (1995) 4. Blum, A., Raghavan, P., Schieber, B.: Navigating in Unfamiliar Geometric Terrain. In: On Line Algorithms, pp. 151–155, DIMACS Series...

Solving NP-Complete Problems Using P Systems with Active Membranes